A priority-based distributed group mutual exclusion algorithm when group access is non-uniform
نویسندگان
چکیده
منابع مشابه
A priority-based distributed group mutual exclusion algorithm when group access is non-uniform
In the group mutual exclusion problem, each critical section has a type or a group associated with it. Processes requesting critical sections belonging to the same group (that is, of the same type) may execute their critical sections concurrently. However, processes requesting critical sections belonging to different groups (that is, of different types) must execute their critical sections in a...
متن کاملAn Efficient Distributed Group Mutual Exclusion Algorithm for Non-Uniform Group Access
In the group mutual exclusion problem, each critical section has a type or a group associated with it. Processes requesting critical sections of the same type may execute their critical sections concurrently. However, processes requesting critical sections of different types must execute their critical sections in a mutually exclusive manner. Most algorithms for group mutual exclusion that have...
متن کاملGROUP k-MUTUAL EXCLUSION FOR DISTRIBUTED SYSTEMS
In this paper, we propose an algorithm to solve the group k-mutual exclusion (Gk-ME) problem for distributed systems. The Gk-ME problem is concerned with controlling the concurrent accesses of some resource by at most k nodes with the constraint that no two distinct resources can be accessed simultaneously. The proposed algorithm utilizes a token circulation mechanism and does not require the n...
متن کاملA Token-Based Fair Algorithm for Group Mutual Exclusion in Distributed Systems
The group mutual exclusion (GME) problem is a generalization of the mutual exclusion problem. In group mutual exclusion, a process requests a session before entering its critical section (CS). Processes requesting the same session are allowed to be in their CS simultaneously, however, processes requesting different sessions must execute their CS in mutually exclusive way. The paper presents a t...
متن کاملA Fault Tolerant Token-based Algorithm for Group Mutual Exclusion in Distributed Systems
The group mutual exclusion (GME) problem is a variant of the mutual exclusion problem. In the present paper a token-based group mutual exclusion algorithm, capable of handling transient faults, is proposed. The algorithm uses the concept of dynamic request sets. A time out mechanism is used to detect the token loss; also, a distributed scheme is used to regenerate the token. The worst case mess...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2007
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2007.02.005